Cantor ’ s Proof in the Full Definable Universe
نویسنده
چکیده
Cantor’s proof that the powerset of the set of all natural numbers is uncountable yields a version of Richard’s paradox when restricted to the full definable universe, that is, to the universe containing all objects that can be defined not just in one formal language but by means of the full expressive power of natural language: this universe seems to be countable on one account and uncountable on another. We argue that the claim that definitional contexts impose restrictions on the scope of quantifiers reveals a natural way out. : Cantor’s Theorem, constructive ordinals, countability, definability, indefinite extensibility, quantifiers, Richard’s Paradox.
منابع مشابه
Continuity of Gödel's System T Definable Functionals via Effectful Forcing
It is well-known that the Gödel’s system T definable functions (N → N) → N are continuous, and that their restrictions from the Baire type (N → N) to the Cantor type (N → 2) are uniformly continuous. We offer a new, relatively short and self-contained proof. The main technical idea is a concrete notion of generic element that doesn’t rely on forcing, Kripke semantics or sheaves, which seems to ...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملof the universe on the basis of the four levels of being and the proof of correspondence
This article has no abstract.
متن کاملOn the Borel Complexity of MSO Definable Sets of Branches
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow some extra monadic predicates on the nodes. We show that this class equals to the Boolean combinations of sets in the Borel class Σ 2 over the Cantor discontinuum. Note that the last coincides with the Borel complexit...
متن کاملFull Groups and Soficity
First, we answer a question of Pestov, by proving that the full group of a sofic equivalence relation is a sofic group. Then, we give a short proof of the theorem of Grigorchuk and Medynets that the topological full group of a minimal Cantor homeomorphism is LEF. Finally, we show that for certain non-amenable groups all the generalized lamplighter groups are sofic.
متن کامل